Bounding the number of common zeros of multivariate polynomials and their consecutive derivatives

نویسندگان

  • Olav Geil
  • Umberto Martínez-Peñas
چکیده

We upper bound the number of common zeros over a finite grid of multivariate polynomials and an arbitrary finite collection of their consecutive Hasse derivatives (in a coordinate-wise sense). To that end, we make use of the tool from Gröbner basis theory known as footprint. Then we establish and prove extensions in this context of a family of well-known results in algebra and combinatorics. These include Alon’s combinatorial Nullstellensatz [1], existence and uniqueness of Hermite interpolating polynomials over a grid, estimations on the parameters of evaluation codes with consecutive derivatives [19], and bounds on the number of zeros of a polynomial by DeMillo and Lipton [7], Schwartz [24], Zippel [25, 26], and Alon and Füredi [2]. As an alternative, we also extend the Schwartz-Zippel bound to weighted multiplicities and discuss its connection with our extension of the footprint bound.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using Chebyshev polynomial’s zeros as point grid for numerical solution of nonlinear PDEs by differential quadrature- based radial basis functions

Radial Basis Functions (RBFs) have been found to be widely successful for the interpolation of scattered data over the last several decades. The numerical solution of nonlinear Partial Differential Equations (PDEs) plays a prominent role in numerical weather forecasting, and many other areas of physics, engineering, and biology. In this paper, Differential Quadrature (DQ) method- based RBFs are...

متن کامل

Domain of attraction of normal law and zeros of random polynomials

Let$ P_{n}(x)= sum_{i=0}^{n} A_{i}x^{i}$ be a random algebraicpolynomial, where $A_{0},A_{1}, cdots $ is a sequence of independent random variables belong to the domain of attraction of the normal law. Thus $A_j$'s for $j=0,1cdots $ possesses the characteristic functions $exp {-frac{1}{2}t^{2}H_{j}(t)}$, where $H_j(t)$'s are complex slowlyvarying functions.Under the assumption that there exist ...

متن کامل

An Approximation Algorithm for the Number of Zeros of Arbitrary Polynomials over GF[q]

We design the rst polynomial time (for an arbitrary and xed eld GFq]) (;)-approximation algorithm for the number of zeros of arbitrary polynomial f(x 1 ; : : :; x n) over GFq]. It gives the rst eecient method for estimating the number of zeros and nonzeros of multivariate polynomials over small nite elds other than GF2] (like GF3]), the case important for various circuit approximation technique...

متن کامل

On Classifications of Random Polynomials

 Let $ a_0 (omega), a_1 (omega), a_2 (omega), dots, a_n (omega)$ be a sequence of independent random variables defined on a fixed probability space $(Omega, Pr, A)$. There are many known results for the expected number of real zeros of a polynomial $ a_0 (omega) psi_0(x)+ a_1 (omega)psi_1 (x)+, a_2 (omega)psi_2 (x)+...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1707.01354  شماره 

صفحات  -

تاریخ انتشار 2017